#include<bits/stdc++.h>
using namespace std;
int n;
char s[11451];
int main(){
memset(s, 0, sizeof(s));
cin >> n;
gets(s);
gets(s);
int ans, size; ans = size = 0;
for(int i = 0; s[i];){
int j = i;
while(s[j] != '.' && s[j] != '!' && s[j] != '?') j++;
j++;
if(size+j-i > n){
size = 0;
ans++;
if(s[i] == ' ') i++;
}
size += j-i;
if(size > n){
cout << "Impossible";
return 0;
}
i = j;
}
if(size != 0) ans++;
cout << ans;
return 0;
}
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |